Structured grid AMG with stencil-collapsing for d-level circulant matrices
نویسندگان
چکیده
SUMMARY We introduce a multigrid method with a stencil collapsing technique for linear systems whose coefficient matrix An ∈ R the eigenvalues of A are given by its generating symbol f , a [0, 2π) d-periodic function, as λ j = f (2πj1/n1, 2πj2/n2,. .. , 2πj d /n d). In the case of banded (multilevel) circulant systems, multigrid is an optimal, i.e. O(n) solver, which is superior to FFT techniques which have complexity O(n log n). As the multigrid technique introduced by Serra et al. is based on the classical AMG theory by Ruge and Stüben, involving the Galerkin product A k = RAnR H for the definition of the coarse grid problem, the technique suffers from stencil growth, a main drawback of algebraic multigrid methods. In the present work, we derive coarse grid operators that are spectrally equivalent to the classical operator defined by the Galerkin operator, while keeping the number of stencil entries constant. To do so, a stencil collapsing technique, which creates sparser stencils, is applied. We will present the technique and show that it produces matrices that are spectrally equivalent to the original matrices for a subclass of d-level circulant matrices.
منابع مشابه
Non-Galerkin Coarse Grids for Algebraic Multigrid
Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. While AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. In particular, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid h...
متن کاملAgents Network on a Grid: An Approach with the Set of Circulant Operators
In this work we present some matrix operators named circulant operators and their action on square matrices. This study on square matrices provides new insights into the structure of the space of square matrices. Moreover it can be useful in various fields as in agents networking on Grid or large-scale distributed self-organizing grid systems. Keywords— Pascal matrices, Binomial Recursion, Circ...
متن کاملThe structured distance to normality of Toeplitz matrices with application to preconditioning
A formula for the distance of a Toeplitz matrix to the subspace of {e}-circulant matrices is presented, and applications of {e}-circulant matrices to preconditioning of linear systems of equations with a Toeplitz matrix are discussed. Copyright c © 2006 John Wiley & Sons, Ltd. key words: Toeplitz matrix, circulant matrix, {e}-circulant, matrix nearness problem, distance to normality, preconditi...
متن کاملData Layout Transformation for Structured-Grid Codes on GPU
We present data layout transformation as an effective performance optimization for memory-bound structuredgrid applications for GPUs. Structured grid applications are a class of applications that compute grid cell values on a regular 2D, 3D or higher dimensional regular grid. Each output point is computed as a function of itself and its nearest neighbors. Stencil code is an instance of this app...
متن کاملRobust and adaptive multigrid methods: comparing structured and algebraic approaches
Although there have been significant advances in robust algebraic multigrid methods in recent years, numerical studies and emerging hardware architectures continue to favor structured-grid approaches. Specifically, implementations of logically structured robust variational multigrid algorithms, such as the Black Box Multigrid (BoxMG) solver, have been shown to be 10 times faster than AMG for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007